Bin packing problem

Results: 81



#Item
51Bin packing problem / Analysis of algorithms / Algorithm / Approximation algorithm / Packing problem / Randomized algorithm / Theoretical computer science / Mathematics / Applied mathematics

50 A New Upper Boundon 2D Online Bin Packing XIN HAN, Dalian University of Technology FRANCIS Y. L. CHIN and HING-FUNG TING, The University of Hong Kong GUOCHUAN ZHANG, Zhejiang University

Add to Reading List

Source URL: i.cs.hku.hk

Language: English - Date: 2012-07-19 02:15:26
52Discrete geometry / Packaging / Packing problem / Furniture / Bin packing problem / Bin / Shelf / Algorithm / Rectangle / Mathematics / Geometry / Applied mathematics

A Thousand Ways to Pack the Bin - A Practical Approach to Two-Dimensional Rectangle Bin Packing Jukka Jylänki February 27, 2010

Add to Reading List

Source URL: clb.demon.fi

Language: English - Date: 2010-02-27 13:44:00
53Mathematical optimization / Operations research / Heuristics / Tabu search / Local search / Algorithm / Bin packing problem / Search algorithm / Greedy algorithm / Mathematics / Numerical analysis / Applied mathematics

P1: SAD Journal of Heuristics KL604-03-Thesen June 23, 1998

Add to Reading List

Source URL: aiinfinance.com

Language: English - Date: 2012-06-26 15:09:28
54NP-complete problems / Combinatorics / Mathematical optimization / Partition problem / Heuristics / Graph theory / Heuristic function / Bin packing problem / Travelling salesman problem / Mathematics / Theoretical computer science / Computational complexity theory

Computational Intelligence, Volume ?, Number ?, 1998 ANALYSIS OF HEURISTIC FOR NUMBER PARTITIONING Ian P. Gent and Toby Walsh fipg,[removed] Department of Computer Science,

Add to Reading List

Source URL: www.cse.unsw.edu.au

Language: English - Date: 2013-07-29 02:04:54
55NP-complete problems / Operations research / Bin packing problem / Mathematical optimization / Greedy algorithm / Minimum spanning tree / Packing problem / Dynamic programming / Approximation algorithm / Mathematics / Theoretical computer science / Applied mathematics

Lecture V §1. Joy Rides Page 1

Add to Reading List

Source URL: cs.nyu.edu

Language: English - Date: 2013-10-01 09:47:54
56Packaging / Packing problem / Quadrilaterals / Rectangle / Bin / Algorithm / Area / Proportionality / Largest empty rectangle / Mathematics / Geometry / Discrete geometry

Optimal Rectangle Packing: Initial Results

Add to Reading List

Source URL: www.aaai.org

Language: English - Date: 2006-01-11 07:52:01
57NP-complete problems / Discrete geometry / Operations research / Combinatorial optimization / Bin packing problem / Generalized assignment problem / Knapsack problem / Packing problem / Strongly NP-complete / Theoretical computer science / Computational complexity theory / Mathematics

Journal of Artificial Intelligence Research[removed]429 Submitted 6/06; published 3/07 Bin Completion Algorithms for Multicontainer Packing, Knapsack, and Covering Problems

Add to Reading List

Source URL: www.jair.org

Language: English - Date: 2009-08-06 19:20:44
58NP-complete problems / Approximation algorithm / Submodular set function / Shortest path problem / Bin packing problem / Vertex cover / Dominating set / Independent set / Computational complexity theory / Theoretical computer science / Graph theory / Mathematics

SODA14 – Accepted Papers Andreas Björklund, Petteri Kaski and Łukasz Kowalik Counting thin subgraphs via packings faster than meet-in-the-middle time Anand Louis and Konstantin Makarychev Approximation Algorithm for

Add to Reading List

Source URL: siam.org

Language: English - Date: 2013-09-19 09:13:08
59NP-complete problems / Operations research / Bin packing problem / Mathematical optimization / Greedy algorithm / Minimum spanning tree / Packing problem / Dynamic programming / Approximation algorithm / Mathematics / Theoretical computer science / Applied mathematics

Lecture V §1. Joy Rides Page 1

Add to Reading List

Source URL: cs.nyu.edu

Language: English - Date: 2013-10-01 09:50:59
60Replication / Storage virtualization / Hash table / Stack / Information science / Bin packing problem / Computing / Search algorithms / Bin

Dynamic and Redundant Data Placement (Extended Abstract) A. Brinkmann, S. Effert, F. Meyer auf der Heide Heinz Nixdorf Institute Paderborn, Germany [removed], {fermat, fmadh}@upb.de

Add to Reading List

Source URL: www14.in.tum.de

Language: English - Date: 2007-10-26 05:08:00
UPDATE